package leetcode_周赛._2021._202103._20210321;

/**
 * @author yzh
 * @data 2021/3/21 11:17
 */
public class _5696 {

    public int countPairs(int[] nums, int low, int high) {
        int ans = 0;
        for (int i = 0; i < nums.length - 1; i++) {
            for (int j = i + 1; j < nums.length; j++) {
                int tem = nums[i] ^ nums[j];
                if (tem >= low && tem <= high) ++ans;
            }
        }
        return ans;
    }
}
